Spanning quadrangulations of triangulated surfaces
نویسندگان
چکیده
منابع مشابه
Topological Quadrangulations of Closed Triangulated Surfaces Using the Reeb Graph
Although surfaces are more and more often represented by dense triangulations, it can be useful to convert them to B-spline surface patches, lying on quadrangles. This paper presents a method for the construction of coarse topological quadrangulations of closed triangulated surfaces, based on Morse theory. In order to construct on the surface a quadrangulation of its canonical polygonal schema,...
متن کاملOn the Approximation Power of Splines on Triangulated Quadrangulations
We study the approximation properties of the bivariate spline spaces S r 3r (} +) of smoothness r and degree 3r deened on triangulations } + which are obtained from arbitrary nondegenerate convex quadrangulations by adding the diagonals of each quadrilateral. Suppose } is a nondegenerate convex quadrangulation of a polygonal domain in IR 2 (see Sect. 6 for details on quadrangulations and techni...
متن کاملLocal chromatic number of quadrangulations of surfaces
The local chromatic number of a graph G, as introduced in [4], is the minimum integer k such that G admits a proper coloring (with an arbitrary number of colors) in which the neighborhood of each vertex uses less than k colors. In [17] a connection of the local chromatic number to topological properties of (a box complex of) the graph was established and in [18] it was shown that a topological ...
متن کاملSpanning Tree Seams for Reducing Parameterization Distortion of Triangulated Surfaces (figures 4, 5, and 6)
Providing a two-dimensional parameterization of threedimensional tesselated surfaces is beneficial to many applications in computer graphics, finite-element surface meshing, surface reconstruction and other areas. The applicability of the parameterization depends on how well it preserves the surface metric structures (angles, distances, areas). For a general surface there is no mapping which fu...
متن کاملEdge-disjoint Spanning Trees in Triangulated Graphs on Surfaces and application to node labeling
In 1974, Kundu [4] has shown that triangulated (or maximal) simple toroidal graphs have three edge-disjoint spanning trees. We extend this result by showing that a triangulated graph on an orientable surface of genus g has at least three edge-disjoint spanning trees and so we can partition the edges of graphs of genus g into three forests plus a set of at most 6g − 3 edges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg
سال: 2017
ISSN: 0025-5858,1865-8784
DOI: 10.1007/s12188-016-0172-z